A Euler-Path-Based Multicasting Model for Wormhole-Routed Networks: Its Applications to Damaged 2D Tori and Meshes

In this paper, we develop a new multicasting model for wormhole-routed networks based on the concept of Euler path in graph theory. The model can support multiple multicasts freely from deadlock and can be applied to any network which is Eulerian or is Eulerian after some links being removed. In particular, we demonstrate the power of this model by showing its fault-tolerant capability in supporting multicasting in a damaged 2-D torus or mesh with regular fault patterns (such as single node, block, L-shape, +-shape, U-shape, and H-shape) and even irregular fault patterns. In this regard, it is the rst known multicasting algoirthm in the literature with such strong fault-tolerant capability. Extensive simulations have also been obtained to understand the eeectiveness of this model when applied to damaged 2D tori/meshes under diierent conngurations: communication parameters of the network, nature of traacs, distribution of source and destination nodes, distribution of faults, and patterns of faults.